The p-spectral radius of the Laplacian matrix
نویسندگان
چکیده
منابع مشابه
Sharp Upper Bounds on the Spectral Radius of the Laplacian Matrix of Graphs
Let G = (V,E) be a simple connected graph with n vertices and e edges. Assume that the vertices are ordered such that d1 ≥ d2 ≥ . . . ≥ dn, where di is the degree of vi for i = 1, 2, . . . , n and the average of the degrees of the vertices adjacent to vi is denoted by mi. Let mmax be the maximum of mi’s for i = 1, 2, . . . , n. Also, let ρ(G) denote the largest eigenvalue of the adjacency matri...
متن کاملThe Laplacian Spectral Radius of a Class of Unicyclic Graphs
Let C(n, k) be the set of all unicyclic graphs with n vertices and cycle length k. For anyU ∈ C(n, k),U consists of the (unique) cycle (say Ck) of length k and a certain number of trees attached to the vertices of Ck having (in total) n − k edges. If there are at most two trees attached to the vertices of Ck, where k is even, we identify in the class of unicyclic graphs those graphs whose Lapla...
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولThe Laplacian spectral radius of a graph under perturbation
In this paper, we investigate how the Laplacian spectral radius changes when one graph is transferred to another graph obtained from the original graph by adding some edges, or subdivision, or removing some edges from one vertex to another. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملOn the Signless Laplacian Spectral Radius of Cacti
A cactus is a connected graph in which any two cycles have at most one vertex in common. We determine the unique graphs with maximum signless Laplacian spectral radius in the class of cacti with given number of cycles (cut edges, respectively) as well as in the class of cacti with perfect matchings and given number of cycles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2018
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm170206012b